package binary_tree.leetcode.easy;

/**
 * @author bruin_du
 * @description 二叉树的最近公共祖先
 * @date 2022/6/1 9:33
 **/
public class Offer68II_LowestCommonAncestor {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root == null || root == p || root == q) return root;
        TreeNode left = lowestCommonAncestor(root.left, p, q);
        TreeNode right = lowestCommonAncestor(root.right, p, q);
        if(left == null) return right;
        if(right == null) return left;
        return root;
    }
}
